Traversing Environments Using Possibility Graphs with Multiple Action Types
نویسندگان
چکیده
Locomotion for legged robots poses considerable challenges when confronted by obstacles and adverse environments. Footstep planners are typically only designed for one mode of locomotion, but traversing unfavorable environments may require several forms of locomotion to be sequenced together, such as walking, crawling, and jumping. Multi-modal motion planners can be used to address some of these problems, but existing implementations tend to be time-consuming and are limited to quasi-static actions. This paper presents a motion planning method to traverse complex environments using multiple categories of continuous actions. To this end, this paper formulates and exploits the Possibility Graph—which uses high-level approximations of constraint manifolds to rapidly explore the “possibility” of actions—to utilize lower-level singleaction motion planners more effectively. We show that the Possibility Graph can quickly find routes through several different challenging environments which require various combinations of actions in order to traverse.
منابع مشابه
Traversing Environments Using Possibility Graphs for Humanoid Robots
Locomotion for legged robots poses considerable challenges when confronted by obstacles and adverse environments. Footstep planners are typically only designed for one mode of locomotion, but traversing unfavorable environments may require several forms of locomotion to be sequenced together, such as walking, crawling, and jumping. Multimodal motion planners can be used to address some of these...
متن کاملSearch Graph Formation for Minimizing the Complexity of Planning
A large number of path planning problems are solved by the use of graph based search algorithms. There are a variety of techniques available to optimize the search within these graphs as well as thorough studies of the complexity involved in searching through them. However, little effort has been dedicated to constructing the graphs so that the results of searching will be optimized. The common...
متن کاملDesigning Solvable Graphs for Multiple Moving Agents
Solvable Graphs (also known as Reachable Graphs) are types of graphs that any arrangement of a specified number of agents located on the graph’s vertices can be reached from any initial arrangement through agents’ moves along the graph’s edges, while avoiding deadlocks (interceptions). In this paper, the properties of Solvable Graphs are investigated, and a new concept in multi agent moti...
متن کاملCreating Full Envelopment in Data Envelopment Analysis with Variable Returns to Scale Technology
In this paper, weak defining hyperplanes and the anchor points in DEA, as an important subset of the set of extreme efficient points of the Production Possibility Set (PPS), are used to construct unobserved DMUs and in the long run to improve the envelopment of all observed DMUs. There has been a surge of articles on improving envelopment in recent years. What has been done first is in Constant...
متن کاملConstructing Generalized Universal Traversing Sequences of Polynomial Size for Graphs with Small Diameter (Extended Abstract)
The paper constructs a generalized version of universal traversing sequences. The generalization preserves the features of the universal traversing sequences that make them attractive for applications to derandomizations and space-bounded computation. For every n, a sequence is constructed that is used by a finite-automaton with 0(1) states in order to traverse all the n-vertex labeled undirect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1610.00701 شماره
صفحات -
تاریخ انتشار 2016